package com.arron.algorithm.leetcodetop100.二叉树;

import com.arron.algorithm.tree.TreeNode;
import com.arron.juc.EnumDemo;

public class 相同的树 {


    public boolean isSameTree(TreeNode p, TreeNode q) {


        if (p == null && q == null){
            return true;
        }else if (p == null){
            return false;
        }else if (q == null){
            return false;
        }

        if (p.val != q.val){
            return false;
        }
        return isSameTree(p.left,q.left) && isSameTree(p.right,q.right);
    }




}
